Clustering biomedical and gene expression datasets with kernel density and unique neighborhood set based vein detection

It is a crucial need for a clustering technique to produce high-quality clusters from biomedical and gene expression datasets without requiring any user inputs. Therefore, in this paper we present a clustering technique called KUVClust that produces high-quality clusters when applied on biomedical and gene expression datasets without requiring any user inputs. The KUVClust algorithm uses three concepts namely multivariate kernel density estimation, unique closest neighborhood set and vein-based clustering. Although these concepts are known in the literature, KUVClust combines the concepts in a novel manner to achieve high-quality clustering results. The performance of KUVClust is compared with established clustering techniques on real-world biomedical and gene expression datasets. The comparisons were evaluated in terms of three criteria (purity, entropy, and sum of squared error (SSE)). Experimental results demonstrated the superiority of the proposed technique over the existing techniques for clustering both the low dimensional biomedical and high dimensional gene expressions datasets used in the experiments.     

基于星座图对射频指纹识别方法的研究

针对星座图的射频(RF)指纹识别方案中,低信噪比环境下识别准确率低的问题,提出一种基于欧式距离与幅度距离的二维识别算法来进行RF指纹识别。该方案通过对星座图进行优化处理,可从优化后的星座图中提取识别性能更好的RF指纹,再通过二维识别算法来提高识别准确率。仿真结果表明:与仅用欧式距离作为判断依据的方法相比,所提出的二维识别算法的识别准确率最高可提升8%,在设备容量为50组的情况下识别准确率为77.8%,并且从优化后的星座图中所提取的RF指纹具有更好的唯一性和稳定性。     

A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.     

Evolving accuracy: A genetic algorithm to improve election night forecasts

In this paper, we apply genetic algorithms to the field of electoral studies. Forecasting election results is one of the most exciting and demanding tasks in the area of market research, especially due to the fact that decisions have to be made within seconds on live television. We show that the proposed method outperforms currently applied approaches and thereby provides an argument to tighten the intersection between computer science and social science, especially political science, further. We scrutinize the performance of our algorithm's runtime behavior to evaluate its applicability in the field. Numerical results with real data from a local election in the Austrian province of Styria from 2010 substantiate the applicability of the proposed approach.     

基于改进ISODATA的无先验扩展目标聚类分析算法

基于弹载雷达多扩展目标检测的应用需求,在CFAR检测输出的基础上,对检测结果的聚类分析方法进行了论证分析,提出了改进的ISODATA算法。该算法摆脱了常用聚类分析算法对目标个数、聚类初值等先验信息的要求以及孤立点的影响。数字仿真实验验证了新算法的有效性。     

Managing readiness-relevant activities for the organizational dimension of ERP implementation

An organization requires performing readiness-relevant activities to ensure successful implementation of an enterprise resource planning (ERP) system. This paper develops a novel approach to managing these interrelated activities to get ready for implementing an ERP system. The approach enables an organization to evaluate its ERP implementation readiness by assessing the degree to which it can achieve the interrelated readiness relevant activities using fuzzy cognitive maps. Based on the interrelationship degrees among the activities, the approach clusters the activities into manageable groups and prioritizes them. To help work out a readiness improvement plan, scenario analysis is conducted.     

Fingerprint optimization method for the indoor localization system

The accuracy of the indoor localization is influenced directly by the quality of the fingerprint. But the indoor localization algorithms in existence are almost conducted based on the original fingerprint which is not optimized. The k-means is introduced to optimize the fingerprint in this paper. And deleting the collected bad-points through the theory of cluster could make the fingerprint more accurate for the indoor localization algorithm. Compared with the indoor localization systems in existence, the result of experiments shows that the optimized fingerprint can increase the accurate of indoor localization with a higher probability.     

Particle Swarm Optimization inspired by starling flock behavior

Swarm intelligence is a meta-heuristic algorithm which is widely used nowadays for efficient solution of optimization problems. Particle Swarm Optimization (PSO) is one of the most popular types of swarm intelligence algorithm. This paper proposes a new Particle Swarm Optimization algorithm called Starling PSO based on the collective response of starlings. Although PSO performs well in many problems, algorithms in this category lack mechanisms which add diversity to exploration in the search process. Our proposed algorithm introduces a new mechanism into PSO to add diversity, a mechanism which is inspired by the collective response behavior of starlings. This mechanism consists of three major steps: initialization, which prepares alternative populations for the next steps; identifying seven nearest neighbors; and orientation change which adjusts velocity and position of particles based on those neighbors and selects the best alternative. Because of this collective response mechanism, the Starling PSO explores a wider area of the search space and thus avoids suboptimal solutions. We tested the algorithm with commonly used numerical benchmarking functions as well as applying it to a real world application involving data clustering. In these evaluations, we compared Starling PSO with a variety of state of the art algorithms. The results show that Starling PSO improves the performance of the original PSO and yields the optimal solution in many numerical benchmarking experiments. It also gives the best results in almost all clustering experiments.     

A self-adaptive weighted affinity propagation clustering for key frames extraction on human action recognition

In this paper, we propose a novel approach for key frames extraction on human action recognition from 3D video sequences. To represent human actions, an Energy Feature (EF), combining kinetic energy and potential energy, is extracted from 3D video sequences. A Self-adaptive Weighted Affinity Propagation (SWAP) algorithm is then proposed to extract the key frames. Finally, we employ SVM to recognize human actions on the EFs of selected key frames. The experiments show the information including whole action course can be effectively extracted by our method, and we obtain good recognition performance without losing classification accuracy. Moreover, the recognition speed is greatly improved.     

ECG heart beat classification method based on modified ABC algorithm

Electrocardiogram is the most commonly used tool for the diagnosis of cardiologic diseases. In order to help cardiologists to diagnose the arrhythmias automatically, new methods for automated, computer aided ECG analysis are being developed. In this paper, a Modified Artificial Bee Colony (MABC) algorithm for ECG heart beat classification is introduced. It is applied to ECG data set which is obtained from MITBIH database and the result of MABC is compared with seventeen other classifier's accuracy.In classification problem, some features have higher distinctiveness than others. In this study, in order to find higher distinctive features, a detailed analysis has been done on time domain features. By using the right features in MABC algorithm, high classification success rate (99.30%) is obtained. Other methods generally have high classification accuracy on examined data set, but they have relatively low or even poor sensitivities for some beat types. Different data sets, unbalanced sample numbers in different classes have effect on classification result. When a balanced data set is used, MABC provided the best result as 97.96% among all classifiers.Not only part of the records from examined MITBIH database, but also all data from selected records are used to be able to use developed algorithm on a real time system in the future by using additional software modules and making adaptation on a specific hardware.